Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages
نویسندگان
چکیده
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps (but with immutable stack variables). In particular, we provide simple sound rules for deriving higher-order frame rules, allowing for local reasoning.
منابع مشابه
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs withheap-allocated mutable data structures. As a step toward extending separation logic tohigh-level languages with ML-style general (higher-order) storage, we investigate the com-patibility of nested Hoare triples with several variations of higher-order frame rules.The interaction of nested triples and frame r...
متن کاملPredicate transformer semantics of a higher-order imperative language with record subtyping
Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a higher order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible speciication constructs, for a calculus of reenement. Procedures may have global variables, subject to ...
متن کاملA pi-calculus Process Semantics of Concurrent Idealised ALGOL
We study the use of the-calculus for semantical descriptions of languages such as Concurrent Idealised ALGOL (CIA), combining imperative, functional and concurrent features. We rst present an operational semantics for CIA, given by SOS rules and a contextual form of behavioural equivalence; then a-calculus semantics. As behavioural equivalence on-calculus processes we choose the standard (weak ...
متن کاملProgram Semantics, Intensional Logic and Compositionality
We apply intensional logic to the semantics of an Algol-like programming language. This associates with expressions their meanings relative to \possible worlds", here interpreted as machine states. These meanings lie in the semantic domains of a higher order typed intensional logic. The great advantage of this approach is that it preserves compositionality of the meaning function, even in \opaq...
متن کاملA Linear Logic Model of State
We propose an abstract formal model of state manipulation in the framework of Girard’s linear logic. Two issues motivate this work: how to describe the semantics of higher-order imperative programming langauges and how to incorporate state manipulation in functional programming languages. The central idea is that a state is linear and “regenerative”, where the latter is the property of a value ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2006